منابع مشابه
Token Identity Vs. Type Identity
Idsardi and Raimy 2000 (I&R) propose that the representations posited by a learner are constrained by economy considerations. If a child hears a string like the Temiar continuative [sglOg], two possibilities are available while building the underlying representation of the string. Either the two segments [g] perceived in the string correspond to different tokens of the same type, or they corres...
متن کاملRe-"conceptualizing" Procedural Knowledge in Mathematics
Many mathematics educators have lost sight of the critical importance of the mathematical "understanding" which underlies procedural competence, in part because we do not have a language to refer to this kind of understanding. The modal way of categorizing mathematical knowledge -conceptual and procedural knowledge -is limited in that: (a) it is almost exclusively focused on the mathematics of ...
متن کاملType-token representations in conceptual representation
Concepts of kinds of things (e.g. DOG), have the dual function of specifying how to think about indefinitely many things as well as providing the means for thinking about a single abstract kind which is constituted by indefinitely many instances. In this talk, I sketch a theory of conceptual representation that places this dual function of concepts at its core. The theory is shown to provide a ...
متن کاملRepetition blindness: type recognition without token individuation.
Three experiments are described which use RSVP (rapid serial visual presentation) to demonstrate a new cognitive phenomenon called “repetition blindness”. Subjects have difficulty detecting repeated words-even when the two occurrences are nonconsecutive and differ in case (Experiment 1). In immediate verbatim recall of sentences (Experiment 2), subjects selectively omitted second instances of r...
متن کاملType inference in mathematics
In the theory of programming languages, type inference is the process of inferring the type of an expression automatically, often making use of information from the context in which the expression appears. Such mechanisms turn out to be extremely useful in the practice of interactive theorem proving, whereby users interact with a computational proof assistant to construct formal axiomatic deriv...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Information and Control
سال: 1961
ISSN: 0019-9958
DOI: 10.1016/s0019-9958(61)80016-8